Adaptive Inner - Outer Inverse Iteration
نویسندگان
چکیده
Inverse iteration is a standard technique for nding selected eigenvectors associated with eigenvalues which are known approximately. At each step the solution of a linear system of equations is required, which is usually done by factorizing the system matrix. When direct factorization is impractical, iterative methods can be applied for solving the linear systems. Several results about termination criteria for the inner iteration of this inner-outer iterative scheme have been published. Our experiences indicate that they are too stringent in practice. As an alternative an adaptive algorithm is motivated and proposed. The inner tolerance is decreased only when required. A detailed discussion of implementation details of the inner-outer iterative approach is given. Results with prototype implementations have been very promising: Adaptively selecting the tolerance in the inner iteration results in signi cant reductions in the computational e ort compared to other approaches.
منابع مشابه
A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملInexact Inverse Iterations for the Generalized Eigenvalue Problems
In this paper, we study an inexact inverse iteration with inner-outer iterations for solving the generalized eigenvalue problem Ax = Bx; and analyze how the accuracy in the inner iterations aaects the convergence of the outer iterations. By considering a special stopping criterion depending on a threshold parameter, we show that the outer iteration converges linearly with the threshold paramete...
متن کاملControlling Inner Iterations in the Jacobi-Davidson Method
The Jacobi–Davidson method is an eigenvalue solver which uses the iterative (and in general inaccurate) solution of inner linear systems to progress, in an outer iteration, towards a particular solution of the eigenproblem. In this paper we prove a relation between the residual norm of the inner linear system and the residual norm of the eigenvalue problem. We show that the latter may be estima...
متن کاملTitle of dissertation : LINEAR STABILITY ANALYSIS USING LYAPUNOV INVERSE ITERATION
Title of dissertation: LINEAR STABILITY ANALYSIS USING LYAPUNOV INVERSE ITERATION Minghao Wu, Doctor of Philosophy, 2012 Dissertation directed by: Professor Howard Elman Department of Computer Science Institute for Advanced Computer Studies In this dissertation, we develop robust and efficient methods for linear stability analysis of large-scale dynamical systems, with emphasis on the incompres...
متن کامل